0.12/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.12/0.15	% Command    : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC
0.15/0.36	% Computer   : n008.cluster.edu
0.15/0.36	% Model      : x86_64 x86_64
0.15/0.36	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.15/0.36	% Memory     : 8042.1875MB
0.15/0.36	% OS         : Linux 3.10.0-693.el7.x86_64
0.15/0.36	% CPULimit   : 1200
0.15/0.36	% WCLimit    : 120
0.15/0.36	% DateTime   : Tue Jul 13 10:50:14 EDT 2021
0.15/0.36	% CPUTime    : 
0.15/0.36	% Number of cores: 8
0.15/0.36	% Python version: Python 3.6.8
0.15/0.36	# Version: 2.6rc1-ho
0.15/0.37	# No SInE strategy applied
0.15/0.37	# Trying AutoSched0 for 59 seconds
0.21/0.58	# AutoSched0-Mode selected heuristic G_E___303_C18_F1_URBAN_S0Y
0.21/0.58	# and selection function SelectMaxLComplexAvoidPosPred.
0.21/0.58	#
0.21/0.58	# Preprocessing time       : 0.078 s
0.21/0.58	
0.21/0.58	# Proof found!
0.21/0.58	# SZS status Theorem
0.21/0.58	# SZS output start CNFRefutation
0.21/0.58	thf(def_d_not, axiom, (d_not)=(^[X36:$o]:(X36=>~$true)), file('/export/starexec/sandbox/benchmark/Axioms/NUM007^0.ax', def_d_not)).
0.21/0.58	thf(def_imp, axiom, (imp)=(^[X34:$o, X35:$o]:(X34=>X35)), file('/export/starexec/sandbox/benchmark/Axioms/NUM007^0.ax', def_imp)).
0.21/0.58	thf(def_all_of, axiom, (all_of)=(^[X3:$i > $o, X2:$i > $o]:![X4:$i]:(X3 @ X4=>X2 @ X4)), file('/export/starexec/sandbox/benchmark/Axioms/NUM007^0.ax', def_all_of)).
0.21/0.58	thf(def_is_of, axiom, (is_of)=(^[X1:$i, X2:$i > $o]:X2 @ X1), file('/export/starexec/sandbox/benchmark/Axioms/NUM007^0.ax', def_is_of)).
0.21/0.58	thf(def_non, axiom, (non)=(^[X1:$i, X2:$i > $o, X4:$i]:(X2 @ X4=>~$true)), file('/export/starexec/sandbox/benchmark/Axioms/NUM007^0.ax', def_non)).
0.21/0.58	thf(def_l_some, axiom, (l_some)=(^[X1:$i, X2:$i > $o]:(![X424:$i]:(in @ X424 @ X1=>(X2 @ X424=>~$true))=>~$true)), file('/export/starexec/sandbox/benchmark/Axioms/NUM007^0.ax', def_l_some)).
0.21/0.58	thf(def_n_is, axiom, (n_is)=(^[X500:$i, X501:$i]:(X500)=(X501)), file('/export/starexec/sandbox/benchmark/Axioms/NUM007^0.ax', def_n_is)).
0.21/0.58	thf(def_e_is, axiom, (e_is)=(^[X1:$i, X60:$i, X61:$i]:(X60)=(X61)), file('/export/starexec/sandbox/benchmark/Axioms/NUM007^0.ax', def_e_is)).
0.21/0.58	thf(def_n_some, axiom, (n_some)=(^[X502:$i > $o]:(![X503:$i]:(in @ X503 @ nat=>(X502 @ X503=>~$true))=>~$true)), file('/export/starexec/sandbox/benchmark/Axioms/NUM007^0.ax', def_n_some)).
0.21/0.58	thf(def_diffprop, axiom, (diffprop)=(^[X1:$i, X183:$i, X4:$i]:(X1)=(n_pl @ X183 @ X4)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', def_diffprop)).
0.21/0.58	thf(def_d_29_ii, axiom, (d_29_ii)=(^[X1:$i, X184:$i]:(![X524:$i]:(in @ X524 @ nat=>((X1)=(n_pl @ X184 @ X524)=>~$true))=>~$true)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', def_d_29_ii)).
0.21/0.58	thf(satz19d, conjecture, all_of @ (^[X1:$i]:in @ X1 @ nat) @ (^[X1:$i]:all_of @ (^[X208:$i]:in @ X208 @ nat) @ (^[X209:$i]:all_of @ (^[X4:$i]:in @ X4 @ nat) @ (^[X4:$i]:(d_29_ii @ (n_pl @ X4 @ X1) @ (n_pl @ X4 @ X209)<=d_29_ii @ X1 @ X209)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', satz19d)).
0.21/0.58	thf(satz5, axiom, all_of @ (^[X1:$i]:in @ X1 @ nat) @ (^[X1:$i]:all_of @ (^[X241:$i]:in @ X241 @ nat) @ (^[X242:$i]:all_of @ (^[X4:$i]:in @ X4 @ nat) @ (^[X4:$i]:n_is @ (n_pl @ (n_pl @ X1 @ X242) @ X4) @ (n_pl @ X1 @ (n_pl @ X242 @ X4))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', satz5)).
0.21/0.58	thf(c_0_13, axiom, (d_not)=(^[X36:$o]:(X36=>~$true)), inference(apply_def,[status(thm)],[def_d_not, def_imp])).
0.21/0.58	thf(c_0_14, axiom, (all_of)=(^[X3:$i > $o, X2:$i > $o]:![X4:$i]:(X3 @ X4=>X2 @ X4)), inference(apply_def,[status(thm)],[def_all_of, def_is_of])).
0.21/0.58	thf(c_0_15, axiom, (non)=(^[X1:$i, X2:$i > $o, X4:$i]:(X2 @ X4=>~$true)), inference(apply_def,[status(thm)],[def_non, c_0_13])).
0.21/0.58	thf(c_0_16, axiom, (l_some)=(^[X1:$i, X2:$i > $o]:(![X424:$i]:(in @ X424 @ X1=>(X2 @ X424=>~$true))=>~$true)), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[def_l_some, c_0_14]), c_0_13]), c_0_15])).
0.21/0.58	thf(c_0_17, axiom, (n_is)=(^[X500:$i, X501:$i]:(X500)=(X501)), inference(apply_def,[status(thm)],[def_n_is, def_e_is])).
0.21/0.58	thf(c_0_18, axiom, (n_some)=(^[X502:$i > $o]:(![X503:$i]:(in @ X503 @ nat=>(X502 @ X503=>~$true))=>~$true)), inference(apply_def,[status(thm)],[def_n_some, c_0_16])).
0.21/0.58	thf(c_0_19, axiom, (diffprop)=(^[X1:$i, X183:$i, X4:$i]:(X1)=(n_pl @ X183 @ X4)), inference(apply_def,[status(thm)],[def_diffprop, c_0_17])).
0.21/0.58	thf(c_0_20, axiom, (d_29_ii)=(^[X1:$i, X184:$i]:(![X524:$i]:(in @ X524 @ nat=>((X1)=(n_pl @ X184 @ X524)=>~$true))=>~$true)), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[def_d_29_ii, c_0_18]), c_0_19])).
0.21/0.58	thf(c_0_21, negated_conjecture, ~(![X874:$i]:(in @ X874 @ nat=>![X881:$i]:(in @ X881 @ nat=>![X882:$i]:(in @ X882 @ nat=>(~(![X884:$i]:(in @ X884 @ nat=>(X874)!=(n_pl @ X881 @ X884)))=>~(![X883:$i]:(in @ X883 @ nat=>(n_pl @ X882 @ X874)!=(n_pl @ (n_pl @ X882 @ X881) @ X883)))))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[satz19d]), c_0_14]), c_0_20])])).
0.21/0.58	thf(c_0_22, plain, ![X1189:$i]:(in @ X1189 @ nat=>![X1194:$i]:(in @ X1194 @ nat=>![X1195:$i]:(in @ X1195 @ nat=>(n_pl @ (n_pl @ X1189 @ X1194) @ X1195)=(n_pl @ X1189 @ (n_pl @ X1194 @ X1195))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[satz5, c_0_14]), c_0_17])).
0.21/0.58	thf(c_0_23, negated_conjecture, ![X2019:$i]:(in @ esk46_0 @ nat&(in @ esk47_0 @ nat&(in @ esk48_0 @ nat&((in @ esk49_0 @ nat&(esk46_0)=(n_pl @ esk47_0 @ esk49_0))&(~in @ X2019 @ nat|(n_pl @ esk48_0 @ esk46_0)!=(n_pl @ (n_pl @ esk48_0 @ esk47_0) @ X2019)))))), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_21])])])])).
0.21/0.58	thf(c_0_24, plain, ![X2079:$i, X2080:$i, X2081:$i]:(~in @ X2079 @ nat|(~in @ X2080 @ nat|(~in @ X2081 @ nat|(n_pl @ (n_pl @ X2079 @ X2080) @ X2081)=(n_pl @ X2079 @ (n_pl @ X2080 @ X2081))))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_22])])])).
0.21/0.58	thf(c_0_25, negated_conjecture, ![X1:$i]:(~in @ X1 @ nat|(n_pl @ esk48_0 @ esk46_0)!=(n_pl @ (n_pl @ esk48_0 @ esk47_0) @ X1)), inference(split_conjunct,[status(thm)],[c_0_23])).
0.21/0.58	thf(c_0_26, plain, ![X1:$i, X4:$i, X5:$i]:((n_pl @ (n_pl @ X1 @ X4) @ X5)=(n_pl @ X1 @ (n_pl @ X4 @ X5))|~in @ X1 @ nat|~in @ X4 @ nat|~in @ X5 @ nat), inference(split_conjunct,[status(thm)],[c_0_24])).
0.21/0.58	thf(c_0_27, negated_conjecture, in @ esk47_0 @ nat, inference(split_conjunct,[status(thm)],[c_0_23])).
0.21/0.58	thf(c_0_28, negated_conjecture, in @ esk48_0 @ nat, inference(split_conjunct,[status(thm)],[c_0_23])).
0.21/0.58	thf(c_0_29, negated_conjecture, ![X1:$i]:((n_pl @ esk48_0 @ (n_pl @ esk47_0 @ X1))!=(n_pl @ esk48_0 @ esk46_0)|~in @ X1 @ nat), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25, c_0_26]), c_0_27]), c_0_28])])).
0.21/0.58	thf(c_0_30, negated_conjecture, (esk46_0)=(n_pl @ esk47_0 @ esk49_0), inference(split_conjunct,[status(thm)],[c_0_23])).
0.21/0.58	thf(c_0_31, negated_conjecture, in @ esk49_0 @ nat, inference(split_conjunct,[status(thm)],[c_0_23])).
0.21/0.58	thf(c_0_32, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29, c_0_30]), c_0_31])]), ['proof']).
0.21/0.58	# SZS output end CNFRefutation
0.21/0.58	# Proof object total steps             : 33
0.21/0.58	# Proof object clause steps            : 8
0.21/0.58	# Proof object formula steps           : 25
0.21/0.58	# Proof object conjectures             : 10
0.21/0.58	# Proof object clause conjectures      : 7
0.21/0.58	# Proof object formula conjectures     : 3
0.21/0.58	# Proof object initial clauses used    : 6
0.21/0.58	# Proof object initial formulas used   : 13
0.21/0.58	# Proof object generating inferences   : 2
0.21/0.58	# Proof object simplifying inferences  : 5
0.21/0.58	# Training examples: 0 positive, 0 negative
0.21/0.58	# Parsed axioms                        : 372
0.21/0.58	# Removed by relevancy pruning/SinE    : 0
0.21/0.58	# Initial clauses                      : 550
0.21/0.58	# Removed in clause preprocessing      : 156
0.21/0.58	# Initial clauses in saturation        : 394
0.21/0.58	# Processed clauses                    : 470
0.21/0.58	# ...of these trivial                  : 8
0.21/0.58	# ...subsumed                          : 33
0.21/0.58	# ...remaining for further processing  : 429
0.21/0.58	# Other redundant clauses eliminated   : 628
0.21/0.58	# Clauses deleted for lack of memory   : 0
0.21/0.58	# Backward-subsumed                    : 0
0.21/0.58	# Backward-rewritten                   : 7
0.21/0.58	# Generated clauses                    : 5284
0.21/0.58	# ...of the previous two non-trivial   : 4589
0.21/0.58	# Contextual simplify-reflections      : 1
0.21/0.58	# Paramodulations                      : 4413
0.21/0.58	# Factorizations                       : 0
0.21/0.58	# NegExts                              : 3
0.21/0.58	# Equation resolutions                 : 668
0.21/0.58	# Propositional unsat checks           : 0
0.21/0.58	#    Propositional check models        : 0
0.21/0.58	#    Propositional check unsatisfiable : 0
0.21/0.58	#    Propositional clauses             : 0
0.21/0.58	#    Propositional clauses after purity: 0
0.21/0.58	#    Propositional unsat core size     : 0
0.21/0.58	#    Propositional preprocessing time  : 0.000
0.21/0.58	#    Propositional encoding time       : 0.000
0.21/0.58	#    Propositional solver time         : 0.000
0.21/0.58	#    Success case prop preproc time    : 0.000
0.21/0.58	#    Success case prop encoding time   : 0.000
0.21/0.58	#    Success case prop solver time     : 0.000
0.21/0.58	# Current number of processed clauses  : 390
0.21/0.58	#    Positive orientable unit clauses  : 89
0.21/0.58	#    Positive unorientable unit clauses: 3
0.21/0.58	#    Negative unit clauses             : 18
0.21/0.58	#    Non-unit-clauses                  : 280
0.21/0.58	# Current number of unprocessed clauses: 4496
0.21/0.58	# ...number of literals in the above   : 21835
0.21/0.58	# Current number of archived formulas  : 0
0.21/0.58	# Current number of archived clauses   : 8
0.21/0.58	# Clause-clause subsumption calls (NU) : 29855
0.21/0.58	# Rec. Clause-clause subsumption calls : 4496
0.21/0.58	# Non-unit clause-clause subsumptions  : 30
0.21/0.58	# Unit Clause-clause subsumption calls : 4648
0.21/0.58	# Rewrite failures with RHS unbound    : 2
0.21/0.58	# BW rewrite match attempts            : 46
0.21/0.58	# BW rewrite match successes           : 5
0.21/0.58	# Condensation attempts                : 0
0.21/0.58	# Condensation successes               : 0
0.21/0.58	# Termbank termtop insertions          : 153380
0.21/0.58	
0.21/0.58	# -------------------------------------------------
0.21/0.58	# User time                : 0.193 s
0.21/0.58	# System time              : 0.021 s
0.21/0.58	# Total time               : 0.214 s
0.21/0.58	# Maximum resident set size: 2228 pages
0.21/0.58	EOF